./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:59:01,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:59:01,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:59:01,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:59:01,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:59:01,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:59:01,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:59:01,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:59:01,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:59:01,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:59:01,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:59:01,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:59:01,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:59:01,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:59:01,141 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:59:01,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:59:01,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:59:01,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:59:01,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:59:01,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:59:01,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:59:01,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:59:01,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:59:01,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:59:01,145 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:59:01,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:59:01,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:59:01,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:59:01,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:59:01,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:59:01,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:59:01,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:59:01,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:59:01,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:59:01,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:59:01,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:59:01,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:59:01,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:59:01,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:59:01,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:59:01,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:59:01,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:59:01,150 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a [2024-10-14 13:59:01,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:59:01,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:59:01,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:59:01,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:59:01,390 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:59:01,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2024-10-14 13:59:02,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:59:02,822 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:59:02,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2024-10-14 13:59:02,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36afda3d4/f359c4ffa59746949885202150c9bbd1/FLAGc569b282a [2024-10-14 13:59:02,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36afda3d4/f359c4ffa59746949885202150c9bbd1 [2024-10-14 13:59:02,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:59:02,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:59:02,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:59:02,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:59:02,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:59:02,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:59:02" (1/1) ... [2024-10-14 13:59:02,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb5c8bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:02, skipping insertion in model container [2024-10-14 13:59:02,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:59:02" (1/1) ... [2024-10-14 13:59:02,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:59:03,029 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i[916,929] [2024-10-14 13:59:03,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:59:03,100 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:59:03,112 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i[916,929] [2024-10-14 13:59:03,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:59:03,168 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:59:03,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03 WrapperNode [2024-10-14 13:59:03,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:59:03,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:59:03,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:59:03,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:59:03,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,230 INFO L138 Inliner]: procedures = 29, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 515 [2024-10-14 13:59:03,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:59:03,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:59:03,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:59:03,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:59:03,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,264 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 18 writes are split as follows [0, 18]. [2024-10-14 13:59:03,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:59:03,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:59:03,331 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:59:03,331 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:59:03,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (1/1) ... [2024-10-14 13:59:03,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:59:03,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:59:03,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:59:03,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:59:03,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:59:03,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:59:03,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:59:03,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:59:03,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:59:03,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:59:03,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:59:03,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:59:03,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:59:03,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:59:03,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:59:03,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:59:03,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:59:03,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:59:03,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:59:03,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:59:03,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:59:03,514 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:59:03,515 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:59:03,951 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-10-14 13:59:03,951 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:59:03,978 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:59:03,978 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:59:03,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:59:03 BoogieIcfgContainer [2024-10-14 13:59:03,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:59:03,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:59:03,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:59:03,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:59:03,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:59:02" (1/3) ... [2024-10-14 13:59:03,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebed35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:59:03, skipping insertion in model container [2024-10-14 13:59:03,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:03" (2/3) ... [2024-10-14 13:59:03,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebed35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:59:03, skipping insertion in model container [2024-10-14 13:59:03,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:59:03" (3/3) ... [2024-10-14 13:59:03,985 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-64.i [2024-10-14 13:59:03,997 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:59:03,998 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:59:04,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:59:04,049 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@55b7b8e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:59:04,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:59:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:59:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:59:04,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:04,064 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:04,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:04,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash 447705921, now seen corresponding path program 1 times [2024-10-14 13:59:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:59:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51956287] [2024-10-14 13:59:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:59:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:59:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:59:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:59:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:59:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:59:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:59:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:59:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:59:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:59:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:59:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:59:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:59:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:59:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:59:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:59:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:59:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:59:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:59:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:59:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:59:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:59:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:59:04,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51956287] [2024-10-14 13:59:04,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51956287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:59:04,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:59:04,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:59:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143845795] [2024-10-14 13:59:04,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:59:04,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:59:04,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:59:04,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:59:04,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:59:04,372 INFO L87 Difference]: Start difference. First operand has 122 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:04,404 INFO L93 Difference]: Finished difference Result 241 states and 388 transitions. [2024-10-14 13:59:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:59:04,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2024-10-14 13:59:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:04,413 INFO L225 Difference]: With dead ends: 241 [2024-10-14 13:59:04,413 INFO L226 Difference]: Without dead ends: 120 [2024-10-14 13:59:04,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:59:04,419 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:04,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:59:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-14 13:59:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-14 13:59:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:59:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 180 transitions. [2024-10-14 13:59:04,455 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 180 transitions. Word has length 154 [2024-10-14 13:59:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:04,455 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 180 transitions. [2024-10-14 13:59:04,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 180 transitions. [2024-10-14 13:59:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:59:04,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:04,459 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:04,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:59:04,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:04,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash -85840479, now seen corresponding path program 1 times [2024-10-14 13:59:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:59:04,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552016558] [2024-10-14 13:59:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:04,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:59:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:59:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:59:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:59:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:59:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:59:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:59:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:59:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:59:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:59:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:59:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:59:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:59:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:59:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:59:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:59:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:59:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:59:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:59:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:59:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:59:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:59:04,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:59:04,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552016558] [2024-10-14 13:59:04,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552016558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:59:04,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:59:04,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:59:04,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171450264] [2024-10-14 13:59:04,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:59:04,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:59:04,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:59:04,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:59:04,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:59:04,783 INFO L87 Difference]: Start difference. First operand 120 states and 180 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:04,839 INFO L93 Difference]: Finished difference Result 241 states and 362 transitions. [2024-10-14 13:59:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:59:04,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2024-10-14 13:59:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:04,843 INFO L225 Difference]: With dead ends: 241 [2024-10-14 13:59:04,843 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 13:59:04,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:59:04,846 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:04,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:59:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 13:59:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-14 13:59:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:59:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2024-10-14 13:59:04,862 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 154 [2024-10-14 13:59:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:04,866 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2024-10-14 13:59:04,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2024-10-14 13:59:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:59:04,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:04,868 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:04,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:59:04,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:04,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:04,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1221301919, now seen corresponding path program 1 times [2024-10-14 13:59:04,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:59:04,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314080758] [2024-10-14 13:59:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:04,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:59:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:59:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:59:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:59:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:59:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:59:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:59:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:59:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:59:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:59:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:59:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:59:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:59:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:59:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:59:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:59:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:59:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:59:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:59:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:59:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:59:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:59:05,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:59:05,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314080758] [2024-10-14 13:59:05,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314080758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:59:05,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:59:05,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:59:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844089989] [2024-10-14 13:59:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:59:05,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:59:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:59:05,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:59:05,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:59:05,077 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:59:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:05,120 INFO L93 Difference]: Finished difference Result 245 states and 366 transitions. [2024-10-14 13:59:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:59:05,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-10-14 13:59:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:05,122 INFO L225 Difference]: With dead ends: 245 [2024-10-14 13:59:05,124 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 13:59:05,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:59:05,125 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:05,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:59:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 13:59:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-14 13:59:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:59:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-10-14 13:59:05,139 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 154 [2024-10-14 13:59:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:05,140 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-10-14 13:59:05,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:59:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-10-14 13:59:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 13:59:05,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:05,172 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:05,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:59:05,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:05,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash -301813043, now seen corresponding path program 1 times [2024-10-14 13:59:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:59:05,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248891771] [2024-10-14 13:59:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:59:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:59:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:59:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:59:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:59:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:59:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:59:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:59:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:59:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:59:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:59:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:59:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:59:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:59:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:59:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:59:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:59:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:59:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:59:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:59:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:59:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:59:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:59:05,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248891771] [2024-10-14 13:59:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248891771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:59:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:59:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:59:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237406385] [2024-10-14 13:59:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:59:05,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:59:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:59:05,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:59:05,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:59:05,447 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:59:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:05,487 INFO L93 Difference]: Finished difference Result 250 states and 371 transitions. [2024-10-14 13:59:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:59:05,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-10-14 13:59:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:05,492 INFO L225 Difference]: With dead ends: 250 [2024-10-14 13:59:05,492 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 13:59:05,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:59:05,494 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:05,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 681 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:59:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 13:59:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-14 13:59:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:59:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 187 transitions. [2024-10-14 13:59:05,507 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 187 transitions. Word has length 156 [2024-10-14 13:59:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:05,508 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 187 transitions. [2024-10-14 13:59:05,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:59:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2024-10-14 13:59:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 13:59:05,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:05,510 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:05,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:59:05,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:05,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2079253832, now seen corresponding path program 1 times [2024-10-14 13:59:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:59:05,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969461335] [2024-10-14 13:59:05,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:05,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:59:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:59:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:59:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:59:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:59:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:59:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:59:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:59:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:59:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:59:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:59:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:59:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:59:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:59:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:59:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:59:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:59:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:59:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:59:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:59:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:59:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:59:07,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:59:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969461335] [2024-10-14 13:59:07,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969461335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:59:07,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:59:07,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:59:07,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126157898] [2024-10-14 13:59:07,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:59:07,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:59:07,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:59:07,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:59:07,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:59:07,228 INFO L87 Difference]: Start difference. First operand 127 states and 187 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:07,993 INFO L93 Difference]: Finished difference Result 429 states and 630 transitions. [2024-10-14 13:59:07,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:59:07,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2024-10-14 13:59:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:07,995 INFO L225 Difference]: With dead ends: 429 [2024-10-14 13:59:07,995 INFO L226 Difference]: Without dead ends: 303 [2024-10-14 13:59:07,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:59:07,996 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 291 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:07,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 633 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:59:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-14 13:59:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 212. [2024-10-14 13:59:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 169 states have (on average 1.378698224852071) internal successors, (233), 169 states have internal predecessors, (233), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:59:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 313 transitions. [2024-10-14 13:59:08,020 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 313 transitions. Word has length 157 [2024-10-14 13:59:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:08,021 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 313 transitions. [2024-10-14 13:59:08,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 313 transitions. [2024-10-14 13:59:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 13:59:08,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:08,022 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:08,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:59:08,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:08,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1604050344, now seen corresponding path program 1 times [2024-10-14 13:59:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:59:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389591516] [2024-10-14 13:59:08,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:59:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:08,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:59:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:59:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:08,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:59:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:08,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:59:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:59:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:59:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:59:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:59:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:59:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:59:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:59:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:59:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:59:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:59:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:59:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:59:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:59:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:59:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:59:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:59:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-14 13:59:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:59:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389591516] [2024-10-14 13:59:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389591516] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:59:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355052295] [2024-10-14 13:59:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:09,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:59:09,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:59:09,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:59:09,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 13:59:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:09,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 13:59:09,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:59:09,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-14 13:59:09,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-14 13:59:09,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-14 13:59:09,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:59:09,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2024-10-14 13:59:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 357 proven. 18 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-10-14 13:59:09,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:59:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-14 13:59:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355052295] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:59:10,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:59:10,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 28 [2024-10-14 13:59:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474640909] [2024-10-14 13:59:10,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:59:10,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 13:59:10,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:59:10,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 13:59:10,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2024-10-14 13:59:10,154 INFO L87 Difference]: Start difference. First operand 212 states and 313 transitions. Second operand has 28 states, 25 states have (on average 5.92) internal successors, (148), 28 states have internal predecessors, (148), 8 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) [2024-10-14 13:59:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:12,707 INFO L93 Difference]: Finished difference Result 557 states and 801 transitions. [2024-10-14 13:59:12,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-14 13:59:12,707 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 5.92) internal successors, (148), 28 states have internal predecessors, (148), 8 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) Word has length 158 [2024-10-14 13:59:12,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:12,709 INFO L225 Difference]: With dead ends: 557 [2024-10-14 13:59:12,709 INFO L226 Difference]: Without dead ends: 412 [2024-10-14 13:59:12,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=641, Invalid=4189, Unknown=0, NotChecked=0, Total=4830 [2024-10-14 13:59:12,712 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1198 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 3213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:12,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 1715 Invalid, 3213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2902 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 13:59:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-14 13:59:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 320. [2024-10-14 13:59:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 260 states have (on average 1.3653846153846154) internal successors, (355), 261 states have internal predecessors, (355), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-14 13:59:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2024-10-14 13:59:12,736 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 158 [2024-10-14 13:59:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:12,737 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2024-10-14 13:59:12,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 5.92) internal successors, (148), 28 states have internal predecessors, (148), 8 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 5 states have call predecessors, (47), 8 states have call successors, (47) [2024-10-14 13:59:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2024-10-14 13:59:12,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 13:59:12,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:12,739 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:12,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:59:12,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 13:59:12,944 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:12,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:12,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1645531870, now seen corresponding path program 1 times [2024-10-14 13:59:12,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:59:12,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233415423] [2024-10-14 13:59:12,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:12,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:59:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:59:13,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300692034] [2024-10-14 13:59:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:13,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:59:13,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:59:13,074 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:59:13,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 13:59:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:13,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-14 13:59:13,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:59:13,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:59:13,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 13:59:13,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:59:13,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-14 13:59:13,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-14 13:59:13,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-14 13:59:13,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-14 13:59:13,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-14 13:59:13,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-14 13:59:13,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-14 13:59:14,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-14 13:59:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 343 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 13:59:14,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:59:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-14 13:59:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:59:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233415423] [2024-10-14 13:59:14,606 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:59:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300692034] [2024-10-14 13:59:14,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300692034] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:59:14,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:59:14,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2024-10-14 13:59:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067846351] [2024-10-14 13:59:14,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:59:14,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 13:59:14,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:59:14,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 13:59:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:59:14,608 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand has 14 states, 12 states have (on average 9.166666666666666) internal successors, (110), 14 states have internal predecessors, (110), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 6 states have call successors, (40) [2024-10-14 13:59:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:15,489 INFO L93 Difference]: Finished difference Result 675 states and 962 transitions. [2024-10-14 13:59:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 13:59:15,490 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.166666666666666) internal successors, (110), 14 states have internal predecessors, (110), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 6 states have call successors, (40) Word has length 159 [2024-10-14 13:59:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:15,493 INFO L225 Difference]: With dead ends: 675 [2024-10-14 13:59:15,493 INFO L226 Difference]: Without dead ends: 433 [2024-10-14 13:59:15,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-10-14 13:59:15,494 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 509 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:15,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 583 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 13:59:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-14 13:59:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 421. [2024-10-14 13:59:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 349 states have (on average 1.3581661891117478) internal successors, (474), 352 states have internal predecessors, (474), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-14 13:59:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2024-10-14 13:59:15,521 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 159 [2024-10-14 13:59:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:15,521 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2024-10-14 13:59:15,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.166666666666666) internal successors, (110), 14 states have internal predecessors, (110), 6 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 6 states have call successors, (40) [2024-10-14 13:59:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2024-10-14 13:59:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 13:59:15,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:15,523 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:15,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 13:59:15,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 13:59:15,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:15,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1779545376, now seen corresponding path program 1 times [2024-10-14 13:59:15,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:59:15,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049688625] [2024-10-14 13:59:15,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:15,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:59:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:59:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:59:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:59:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:59:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:59:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:59:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:59:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:59:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:59:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 13:59:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:59:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:59:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:59:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:59:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:59:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:59:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:59:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:59:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:59:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:59:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:59:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:59:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049688625] [2024-10-14 13:59:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049688625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:59:17,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:59:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:59:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016007760] [2024-10-14 13:59:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:59:17,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:59:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:59:17,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:59:17,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:59:17,098 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:17,579 INFO L93 Difference]: Finished difference Result 829 states and 1181 transitions. [2024-10-14 13:59:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:59:17,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2024-10-14 13:59:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:17,582 INFO L225 Difference]: With dead ends: 829 [2024-10-14 13:59:17,582 INFO L226 Difference]: Without dead ends: 517 [2024-10-14 13:59:17,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:59:17,583 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 63 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:17,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 576 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:59:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-10-14 13:59:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 442. [2024-10-14 13:59:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 370 states have (on average 1.3621621621621622) internal successors, (504), 373 states have internal predecessors, (504), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-14 13:59:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2024-10-14 13:59:17,627 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 159 [2024-10-14 13:59:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:17,627 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2024-10-14 13:59:17,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2024-10-14 13:59:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 13:59:17,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:17,628 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:17,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:59:17,629 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:17,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1521379938, now seen corresponding path program 1 times [2024-10-14 13:59:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:59:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491189481] [2024-10-14 13:59:17,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:17,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:59:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:59:17,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073987583] [2024-10-14 13:59:17,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:17,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:59:17,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:59:17,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:59:17,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 13:59:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:59:18,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:59:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:59:18,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:59:18,592 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:59:18,593 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:59:18,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 13:59:18,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:59:18,798 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:18,864 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:59:18,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:59:18 BoogieIcfgContainer [2024-10-14 13:59:18,866 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:59:18,866 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:59:18,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:59:18,867 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:59:18,867 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:59:03" (3/4) ... [2024-10-14 13:59:18,868 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:59:18,869 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:59:18,869 INFO L158 Benchmark]: Toolchain (without parser) took 16010.65ms. Allocated memory was 205.5MB in the beginning and 612.4MB in the end (delta: 406.8MB). Free memory was 134.7MB in the beginning and 273.6MB in the end (delta: -138.9MB). Peak memory consumption was 270.0MB. Max. memory is 16.1GB. [2024-10-14 13:59:18,870 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 205.5MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:59:18,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.00ms. Allocated memory is still 205.5MB. Free memory was 134.5MB in the beginning and 116.8MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 13:59:18,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.49ms. Allocated memory is still 205.5MB. Free memory was 116.8MB in the beginning and 112.2MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 13:59:18,870 INFO L158 Benchmark]: Boogie Preprocessor took 96.92ms. Allocated memory is still 205.5MB. Free memory was 112.2MB in the beginning and 171.9MB in the end (delta: -59.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 13:59:18,870 INFO L158 Benchmark]: RCFGBuilder took 649.59ms. Allocated memory is still 205.5MB. Free memory was 171.9MB in the beginning and 132.6MB in the end (delta: 39.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-14 13:59:18,871 INFO L158 Benchmark]: TraceAbstraction took 14886.24ms. Allocated memory was 205.5MB in the beginning and 612.4MB in the end (delta: 406.8MB). Free memory was 131.5MB in the beginning and 274.7MB in the end (delta: -143.1MB). Peak memory consumption was 265.8MB. Max. memory is 16.1GB. [2024-10-14 13:59:18,871 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 612.4MB. Free memory was 274.7MB in the beginning and 273.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 13:59:18,872 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 205.5MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.00ms. Allocated memory is still 205.5MB. Free memory was 134.5MB in the beginning and 116.8MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.49ms. Allocated memory is still 205.5MB. Free memory was 116.8MB in the beginning and 112.2MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.92ms. Allocated memory is still 205.5MB. Free memory was 112.2MB in the beginning and 171.9MB in the end (delta: -59.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 649.59ms. Allocated memory is still 205.5MB. Free memory was 171.9MB in the beginning and 132.6MB in the end (delta: 39.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14886.24ms. Allocated memory was 205.5MB in the beginning and 612.4MB in the end (delta: 406.8MB). Free memory was 131.5MB in the beginning and 274.7MB in the end (delta: -143.1MB). Peak memory consumption was 265.8MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 612.4MB. Free memory was 274.7MB in the beginning and 273.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someUnaryDOUBLEoperation at line 46. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0.9, 128, 2941876006, 256, 63.5, -0.151, 0.8, 9.5, 0, 0, 0, -2, 10, 8, 16 }; [L57] unsigned char last_1_WrapperStruct00_var_1_16 = 10; [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] CALL updateLastVariables() [L125] EXPR WrapperStruct00.var_1_16 [L125] last_1_WrapperStruct00_var_1_16 = WrapperStruct00.var_1_16 [L135] RET updateLastVariables() [L136] CALL updateVariables() [L92] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L94] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L95] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L96] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L97] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L98] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L99] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_6 [L103] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_6 [L103] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L104] WrapperStruct00.var_1_7 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_7 [L105] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_7 [L105] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L106] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_8 [L107] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_8 [L107] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L113] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L116] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L117] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L120] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L136] RET updateVariables() [L137] CALL step() [L61] signed long int stepLocal_1 = last_1_WrapperStruct00_var_1_16; [L62] EXPR WrapperStruct00.var_1_3 [L62] unsigned long int stepLocal_0 = WrapperStruct00.var_1_3; [L63] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L63] COND TRUE stepLocal_1 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16) [L64] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L64] EXPR (((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16) [L64] EXPR (((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10, stepLocal_0=2147483647] [L64] COND FALSE !(stepLocal_0 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) [L69] EXPR WrapperStruct00.var_1_9 [L69] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_9 [L72] EXPR WrapperStruct00.var_1_1 [L72] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L72] COND FALSE !(WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) [L75] EXPR WrapperStruct00.var_1_2 [L75] EXPR WrapperStruct00.var_1_5 [L75] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L75] EXPR WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L75] unsigned long int stepLocal_2 = WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17); [L76] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L76] COND FALSE !(stepLocal_2 > WrapperStruct00.var_1_3) [L83] EXPR WrapperStruct00.var_1_18 [L83] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_18 [L85] WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L85] COND FALSE !(WrapperStruct00.var_1_10) [L137] RET step() [L138] CALL, EXPR property() [L128] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1 [L128] EXPR WrapperStruct00.var_1_3 [L128] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16) [L128] EXPR (((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) [L128] EXPR WrapperStruct00.var_1_1 [L128] EXPR WrapperStruct00.var_1_9 [L128] EXPR (WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR ((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR ((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR (((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR ((((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1)) && (((WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17)) > WrapperStruct00.var_1_3) ? ((! WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128] EXPR ((((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1)) && (((WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17)) > WrapperStruct00.var_1_3) ? ((! WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L128-L129] return ((((last_1_WrapperStruct00_var_1_16 <= (WrapperStruct00.var_1_3 - last_1_WrapperStruct00_var_1_16)) ? ((WrapperStruct00.var_1_3 < (((((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) > (last_1_WrapperStruct00_var_1_16)) ? ((last_1_WrapperStruct00_var_1_16 / WrapperStruct00.var_1_5)) : (last_1_WrapperStruct00_var_1_16)))) ? (((WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9)) : 1) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_9))) : 1) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_10 == ((unsigned char) (! (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_12)))) : 1)) && (WrapperStruct00.var_1_10 ? ((WrapperStruct00.var_1_12 || (WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_13 == ((signed short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : 1) : 1)) && (((WrapperStruct00.var_1_2 & (WrapperStruct00.var_1_5 / WrapperStruct00.var_1_17)) > WrapperStruct00.var_1_3) ? ((! WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_18))) ; [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2090 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2061 mSDsluCounter, 5394 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4259 mSDsCounter, 497 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4979 IncrementalHoareTripleChecker+Invalid, 5476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 497 mSolverCounterUnsat, 1135 mSDtfsCounter, 4979 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1065 GetRequests, 949 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=442occurred in iteration=8, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 270 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1886 NumberOfCodeBlocks, 1886 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1715 ConstructedInterpolants, 0 QuantifiedInterpolants, 8759 SizeOfPredicates, 7 NumberOfNonLiveVariables, 943 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 8195/8360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 13:59:18,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:59:21,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:59:21,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:59:21,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:59:21,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:59:21,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:59:21,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:59:21,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:59:21,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:59:21,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:59:21,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:59:21,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:59:21,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:59:21,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:59:21,263 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:59:21,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:59:21,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:59:21,264 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:59:21,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:59:21,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:59:21,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:59:21,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:59:21,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:59:21,268 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:59:21,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:59:21,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:59:21,268 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:59:21,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:59:21,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:59:21,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:59:21,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:59:21,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:59:21,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:59:21,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:59:21,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:59:21,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:59:21,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:59:21,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:59:21,271 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:59:21,271 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:59:21,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:59:21,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:59:21,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:59:21,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:59:21,273 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:59:21,273 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1284d110aec8c9fc5da783d4e31facf9c686765dccc1866ab0c2c6ea65f610a [2024-10-14 13:59:21,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:59:21,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:59:21,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:59:21,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:59:21,574 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:59:21,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2024-10-14 13:59:22,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:59:23,086 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:59:23,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i [2024-10-14 13:59:23,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/883901f0e/0727374758bf4513a4179aef21a7a996/FLAG02ff680b9 [2024-10-14 13:59:23,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/883901f0e/0727374758bf4513a4179aef21a7a996 [2024-10-14 13:59:23,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:59:23,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:59:23,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:59:23,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:59:23,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:59:23,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb91aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23, skipping insertion in model container [2024-10-14 13:59:23,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:59:23,280 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i[916,929] [2024-10-14 13:59:23,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:59:23,365 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:59:23,376 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-64.i[916,929] [2024-10-14 13:59:23,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:59:23,445 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:59:23,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23 WrapperNode [2024-10-14 13:59:23,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:59:23,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:59:23,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:59:23,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:59:23,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,517 INFO L138 Inliner]: procedures = 39, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2024-10-14 13:59:23,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:59:23,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:59:23,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:59:23,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:59:23,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,557 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 18 writes are split as follows [0, 18]. [2024-10-14 13:59:23,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:59:23,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:59:23,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:59:23,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:59:23,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (1/1) ... [2024-10-14 13:59:23,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:59:23,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:59:23,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:59:23,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:59:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:59:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-14 13:59:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-14 13:59:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 13:59:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 13:59:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:59:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:59:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 13:59:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 13:59:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:59:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:59:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:59:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:59:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 13:59:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 13:59:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-14 13:59:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-14 13:59:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:59:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:59:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 13:59:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 13:59:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 13:59:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 13:59:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 13:59:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 13:59:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:59:23,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:59:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:59:23,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:59:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:59:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:59:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 13:59:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 13:59:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:59:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:59:23,800 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:59:23,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:59:25,328 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-10-14 13:59:25,328 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:59:25,374 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:59:25,374 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:59:25,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:59:25 BoogieIcfgContainer [2024-10-14 13:59:25,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:59:25,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:59:25,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:59:25,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:59:25,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:59:23" (1/3) ... [2024-10-14 13:59:25,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3f922c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:59:25, skipping insertion in model container [2024-10-14 13:59:25,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:59:23" (2/3) ... [2024-10-14 13:59:25,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3f922c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:59:25, skipping insertion in model container [2024-10-14 13:59:25,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:59:25" (3/3) ... [2024-10-14 13:59:25,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-64.i [2024-10-14 13:59:25,396 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:59:25,397 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:59:25,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:59:25,452 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38d4b39b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:59:25,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:59:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 92 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:59:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 13:59:25,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:25,466 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:25,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:25,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1228020509, now seen corresponding path program 1 times [2024-10-14 13:59:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:59:25,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189580756] [2024-10-14 13:59:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:25,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:59:25,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:59:25,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:59:25,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 13:59:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:25,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:59:25,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:59:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-10-14 13:59:25,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:59:25,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:59:25,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189580756] [2024-10-14 13:59:25,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189580756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:59:25,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:59:25,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:59:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27687492] [2024-10-14 13:59:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:59:25,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:59:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:59:25,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:59:25,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:59:25,868 INFO L87 Difference]: Start difference. First operand has 114 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 92 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:25,924 INFO L93 Difference]: Finished difference Result 225 states and 364 transitions. [2024-10-14 13:59:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:59:25,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 152 [2024-10-14 13:59:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:25,933 INFO L225 Difference]: With dead ends: 225 [2024-10-14 13:59:25,933 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 13:59:25,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:59:25,938 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:25,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:59:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 13:59:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-14 13:59:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:59:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 168 transitions. [2024-10-14 13:59:25,978 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 168 transitions. Word has length 152 [2024-10-14 13:59:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:25,978 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 168 transitions. [2024-10-14 13:59:25,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 168 transitions. [2024-10-14 13:59:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 13:59:25,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:25,981 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:25,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 13:59:26,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:59:26,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:26,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash -913314435, now seen corresponding path program 1 times [2024-10-14 13:59:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:59:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432115344] [2024-10-14 13:59:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:26,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:59:26,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:59:26,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:59:26,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 13:59:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:26,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:59:26,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:59:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-14 13:59:26,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:59:26,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:59:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432115344] [2024-10-14 13:59:26,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432115344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:59:26,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:59:26,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:59:26,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046560388] [2024-10-14 13:59:26,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:59:26,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:59:26,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:59:26,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:59:26,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:59:26,507 INFO L87 Difference]: Start difference. First operand 112 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:26,559 INFO L93 Difference]: Finished difference Result 225 states and 338 transitions. [2024-10-14 13:59:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:59:26,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 152 [2024-10-14 13:59:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:26,561 INFO L225 Difference]: With dead ends: 225 [2024-10-14 13:59:26,562 INFO L226 Difference]: Without dead ends: 114 [2024-10-14 13:59:26,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:59:26,563 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:26,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:59:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-14 13:59:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-14 13:59:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:59:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 170 transitions. [2024-10-14 13:59:26,572 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 170 transitions. Word has length 152 [2024-10-14 13:59:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:26,573 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 170 transitions. [2024-10-14 13:59:26,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:59:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 170 transitions. [2024-10-14 13:59:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 13:59:26,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:26,575 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:26,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 13:59:26,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:59:26,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:26,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1944355333, now seen corresponding path program 1 times [2024-10-14 13:59:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:59:26,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963213566] [2024-10-14 13:59:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:26,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:59:26,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:59:26,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:59:26,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 13:59:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:27,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:59:27,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:59:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:59:27,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:59:27,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:59:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963213566] [2024-10-14 13:59:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963213566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:59:27,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:59:27,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:59:27,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811288028] [2024-10-14 13:59:27,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:59:27,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:59:27,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:59:27,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:59:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:59:27,053 INFO L87 Difference]: Start difference. First operand 114 states and 170 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:59:27,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:27,114 INFO L93 Difference]: Finished difference Result 229 states and 342 transitions. [2024-10-14 13:59:27,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:59:27,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-10-14 13:59:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:27,116 INFO L225 Difference]: With dead ends: 229 [2024-10-14 13:59:27,116 INFO L226 Difference]: Without dead ends: 116 [2024-10-14 13:59:27,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:59:27,117 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:27,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:59:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-14 13:59:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-14 13:59:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:59:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-10-14 13:59:27,134 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 152 [2024-10-14 13:59:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:27,136 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-10-14 13:59:27,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:59:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-10-14 13:59:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:59:27,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:27,141 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:27,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 13:59:27,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:59:27,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:27,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1277402743, now seen corresponding path program 1 times [2024-10-14 13:59:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:59:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229350120] [2024-10-14 13:59:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:27,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:59:27,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:59:27,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:59:27,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 13:59:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:27,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:59:27,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:59:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:59:27,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:59:27,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:59:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229350120] [2024-10-14 13:59:27,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229350120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:59:27,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:59:27,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:59:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980754378] [2024-10-14 13:59:27,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:59:27,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:59:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:59:27,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:59:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:59:27,611 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:59:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:59:27,665 INFO L93 Difference]: Finished difference Result 234 states and 347 transitions. [2024-10-14 13:59:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:59:27,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-10-14 13:59:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:59:27,678 INFO L225 Difference]: With dead ends: 234 [2024-10-14 13:59:27,678 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 13:59:27,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:59:27,679 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:59:27,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 633 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:59:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 13:59:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-14 13:59:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:59:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2024-10-14 13:59:27,685 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 154 [2024-10-14 13:59:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:59:27,686 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2024-10-14 13:59:27,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:59:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2024-10-14 13:59:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 13:59:27,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:59:27,688 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:59:27,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 13:59:27,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:59:27,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:59:27,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:59:27,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2124051907, now seen corresponding path program 1 times [2024-10-14 13:59:27,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:59:27,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998258039] [2024-10-14 13:59:27,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:59:27,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:59:27,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:59:27,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:59:27,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 13:59:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:59:28,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 13:59:28,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:59:28,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 13:59:28,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 13:59:28,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-14 13:59:28,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-14 13:59:28,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-14 13:59:28,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-14 13:59:28,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2024-10-14 13:59:33,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:59:33,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2024-10-14 13:59:33,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:59:33,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2024-10-14 13:59:33,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:59:33,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2024-10-14 13:59:34,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:59:34,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 62 [2024-10-14 13:59:35,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:59:35,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 23 [2024-10-14 13:59:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 563 proven. 51 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-14 13:59:35,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:59:35,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-14 13:59:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-14 13:59:35,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:59:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998258039] [2024-10-14 13:59:35,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998258039] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:59:35,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:59:35,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2024-10-14 13:59:35,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826126832] [2024-10-14 13:59:35,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:59:35,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 13:59:35,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:59:35,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 13:59:35,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=201, Unknown=1, NotChecked=0, Total=272 [2024-10-14 13:59:35,598 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 17 states, 15 states have (on average 7.6) internal successors, (114), 17 states have internal predecessors, (114), 9 states have call successors, (40), 6 states have call predecessors, (40), 8 states have return successors, (40), 7 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-14 13:59:39,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:59:47,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:59:54,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:00:00,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:00:06,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:00:08,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:00:12,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:00:16,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:00:20,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:00:24,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:00:27,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:00:31,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:00:35,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]