./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_codestructure_functionizing_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_codestructure_functionizing_file-5.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 9856b6e1547c77dfc4f03d636d2ddc994fcf61a01f24b8f4037a8d4ac113cc74 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:57:01,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:57:01,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 23:57:01,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:57:01,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:57:01,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:57:01,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:57:01,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:57:01,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:57:01,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:57:01,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:57:01,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:57:01,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:57:01,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:57:01,386 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:57:01,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:57:01,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:57:01,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:57:01,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:57:01,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:57:01,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:57:01,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:57:01,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:57:01,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:57:01,391 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:57:01,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:57:01,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:57:01,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:57:01,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:57:01,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:57:01,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:57:01,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:57:01,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:57:01,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:57:01,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:57:01,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:57:01,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:57:01,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:57:01,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:57:01,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:57:01,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:57:01,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:57:01,398 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 -> 9856b6e1547c77dfc4f03d636d2ddc994fcf61a01f24b8f4037a8d4ac113cc74 [2024-10-12 23:57:01,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:57:01,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:57:01,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:57:01,595 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:57:01,595 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:57:01,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-5.i [2024-10-12 23:57:02,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:57:02,948 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:57:02,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-5.i [2024-10-12 23:57:02,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b864084/f8b53e79cfeb40de9ca230095ae64240/FLAG53dbd41f5 [2024-10-12 23:57:02,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b864084/f8b53e79cfeb40de9ca230095ae64240 [2024-10-12 23:57:02,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:57:02,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:57:02,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:57:02,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:57:02,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:57:02,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:57:02" (1/1) ... [2024-10-12 23:57:02,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc4e3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:02, skipping insertion in model container [2024-10-12 23:57:02,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:57:02" (1/1) ... [2024-10-12 23:57:02,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:57:03,156 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_codestructure_functionizing_file-5.i[919,932] [2024-10-12 23:57:03,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:57:03,215 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:57:03,225 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_codestructure_functionizing_file-5.i[919,932] [2024-10-12 23:57:03,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:57:03,277 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:57:03,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03 WrapperNode [2024-10-12 23:57:03,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:57:03,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:57:03,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:57:03,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:57:03,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,321 INFO L138 Inliner]: procedures = 29, calls = 39, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 156 [2024-10-12 23:57:03,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:57:03,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:57:03,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:57:03,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:57:03,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,351 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:57:03,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:57:03,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:57:03,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:57:03,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:57:03,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (1/1) ... [2024-10-12 23:57:03,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:57:03,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:57:03,406 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-12 23:57:03,409 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-12 23:57:03,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:57:03,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:57:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:57:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:57:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:57:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:57:03,511 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:57:03,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:57:03,780 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-12 23:57:03,783 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:57:03,824 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:57:03,824 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:57:03,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:57:03 BoogieIcfgContainer [2024-10-12 23:57:03,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:57:03,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:57:03,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:57:03,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:57:03,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:57:02" (1/3) ... [2024-10-12 23:57:03,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3653bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:57:03, skipping insertion in model container [2024-10-12 23:57:03,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:03" (2/3) ... [2024-10-12 23:57:03,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3653bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:57:03, skipping insertion in model container [2024-10-12 23:57:03,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:57:03" (3/3) ... [2024-10-12 23:57:03,833 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-5.i [2024-10-12 23:57:03,844 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:57:03,845 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:57:03,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:57:03,899 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;@6ada46c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:57:03,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:57:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 23:57:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 23:57:03,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:57:03,914 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:57:03,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:57:03,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:57:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1736344614, now seen corresponding path program 1 times [2024-10-12 23:57:03,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:57:03,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207854255] [2024-10-12 23:57:03,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:57:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:57:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:57:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:57:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:57:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:57:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:57:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:57:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:57:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:57:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:57:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:57:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:57:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:57:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:57:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:57:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:57:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:57:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:57:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 23:57:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 23:57:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 23:57:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 23:57:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 23:57:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 23:57:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-12 23:57:04,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:57:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207854255] [2024-10-12 23:57:04,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207854255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:57:04,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:57:04,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:57:04,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391886863] [2024-10-12 23:57:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:57:04,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:57:04,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:57:04,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:57:04,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:57:04,323 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-12 23:57:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:57:04,375 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2024-10-12 23:57:04,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:57:04,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 142 [2024-10-12 23:57:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:57:04,384 INFO L225 Difference]: With dead ends: 117 [2024-10-12 23:57:04,384 INFO L226 Difference]: Without dead ends: 58 [2024-10-12 23:57:04,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-12 23:57:04,389 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:57:04,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:57:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-12 23:57:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-12 23:57:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 23:57:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-10-12 23:57:04,421 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 142 [2024-10-12 23:57:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:57:04,421 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-10-12 23:57:04,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-12 23:57:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-10-12 23:57:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 23:57:04,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:57:04,424 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:57:04,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:57:04,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:57:04,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:57:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash 941625680, now seen corresponding path program 1 times [2024-10-12 23:57:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:57:04,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461229514] [2024-10-12 23:57:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:57:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:57:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:57:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:57:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:57:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:57:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:57:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:57:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:57:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:57:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:57:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 23:57:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 23:57:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:57:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 23:57:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:57:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 23:57:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:57:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:57:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 23:57:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 23:57:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 23:57:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 23:57:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 23:57:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 23:57:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-12 23:57:05,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:57:05,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461229514] [2024-10-12 23:57:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461229514] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:57:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217145844] [2024-10-12 23:57:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:57:05,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:57:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:57:05,314 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-12 23:57:05,315 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-12 23:57:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:05,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 23:57:05,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:57:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-12 23:57:05,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:57:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-12 23:57:06,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217145844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:57:06,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:57:06,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-10-12 23:57:06,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456355692] [2024-10-12 23:57:06,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:57:06,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 23:57:06,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:57:06,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 23:57:06,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-12 23:57:06,180 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 3 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2024-10-12 23:57:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:57:06,710 INFO L93 Difference]: Finished difference Result 171 states and 238 transitions. [2024-10-12 23:57:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 23:57:06,710 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 3 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) Word has length 142 [2024-10-12 23:57:06,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:57:06,712 INFO L225 Difference]: With dead ends: 171 [2024-10-12 23:57:06,713 INFO L226 Difference]: Without dead ends: 114 [2024-10-12 23:57:06,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2024-10-12 23:57:06,714 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 125 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:57:06,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 264 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:57:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-12 23:57:06,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2024-10-12 23:57:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-12 23:57:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2024-10-12 23:57:06,735 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 142 [2024-10-12 23:57:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:57:06,735 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2024-10-12 23:57:06,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 3 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2024-10-12 23:57:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2024-10-12 23:57:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 23:57:06,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:57:06,739 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:57:06,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 23:57:06,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:57:06,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:57:06,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:57:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash -461797365, now seen corresponding path program 1 times [2024-10-12 23:57:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:57:06,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853911053] [2024-10-12 23:57:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:57:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:57:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 23:57:07,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158183959] [2024-10-12 23:57:07,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:57:07,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:57:07,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:57:07,030 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-12 23:57:07,032 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-12 23:57:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:57:07,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:57:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:57:07,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:57:07,474 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:57:07,476 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:57:07,486 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-12 23:57:07,679 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,SelfDestructingSolverStorable2 [2024-10-12 23:57:07,682 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-12 23:57:07,767 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:57:07,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:57:07 BoogieIcfgContainer [2024-10-12 23:57:07,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:57:07,770 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:57:07,770 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:57:07,772 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:57:07,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:57:03" (3/4) ... [2024-10-12 23:57:07,774 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:57:07,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:57:07,776 INFO L158 Benchmark]: Toolchain (without parser) took 4805.78ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 89.9MB in the beginning and 182.5MB in the end (delta: -92.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:57:07,776 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:57:07,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.26ms. Allocated memory is still 159.4MB. Free memory was 89.8MB in the beginning and 123.5MB in the end (delta: -33.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-10-12 23:57:07,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.97ms. Allocated memory is still 159.4MB. Free memory was 123.5MB in the beginning and 119.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:57:07,777 INFO L158 Benchmark]: Boogie Preprocessor took 56.60ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 111.5MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 23:57:07,778 INFO L158 Benchmark]: RCFGBuilder took 445.87ms. Allocated memory is still 159.4MB. Free memory was 111.5MB in the beginning and 81.6MB in the end (delta: 30.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-12 23:57:07,778 INFO L158 Benchmark]: TraceAbstraction took 3943.43ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 81.0MB in the beginning and 182.5MB in the end (delta: -101.5MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2024-10-12 23:57:07,779 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 216.0MB. Free memory is still 182.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:57:07,780 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.11ms. Allocated memory is still 159.4MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.26ms. Allocated memory is still 159.4MB. Free memory was 89.8MB in the beginning and 123.5MB in the end (delta: -33.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.97ms. Allocated memory is still 159.4MB. Free memory was 123.5MB in the beginning and 119.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.60ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 111.5MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 445.87ms. Allocated memory is still 159.4MB. Free memory was 111.5MB in the beginning and 81.6MB in the end (delta: 30.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3943.43ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 81.0MB in the beginning and 182.5MB in the end (delta: -101.5MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 216.0MB. Free memory is still 182.5MB. There was no memory consumed. 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 132, overapproximation of someBinaryDOUBLEComparisonOperation at line 132, overapproximation of someBinaryArithmeticDOUBLEoperation at line 79. Possible FailurePath: [L24] unsigned char isInitial = 0; [L25] unsigned char var_1_1 = 10; [L26] unsigned short int var_1_2 = 10; [L27] signed long int var_1_3 = 4; [L28] unsigned char var_1_4 = 128; [L29] unsigned char var_1_5 = 1; [L30] unsigned long int var_1_6 = 5; [L31] float var_1_7 = 2.98; [L32] float var_1_8 = 8.5; [L33] unsigned char var_1_9 = 0; [L34] unsigned char var_1_10 = 64; [L35] unsigned char var_1_11 = 64; [L36] unsigned short int var_1_12 = 25; [L37] signed long int var_1_13 = 256; [L38] unsigned short int var_1_14 = 31408; [L39] double var_1_15 = 64.375; [L40] double var_1_16 = 10.85; [L41] double var_1_17 = 128.8; [L42] double var_1_18 = 2.6; [L43] unsigned char var_1_19 = 0; [L44] unsigned char var_1_20 = 0; [L45] signed short int var_1_21 = -64; [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] FCALL updateLastVariables() [L140] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=4, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=4, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L92] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=4, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=4, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=4, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L93] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=4, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L94] var_1_3 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L95] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L96] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=128, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L97] var_1_4 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L98] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L99] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L100] var_1_5 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L101] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L102] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_7=149/50, var_1_8=17/2, var_1_9=0] [L103] var_1_7 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_8=17/2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_8=17/2, var_1_9=0] [L104] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_8=17/2, var_1_9=0] [L105] var_1_8 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L106] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L107] var_1_10 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L108] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L109] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L110] var_1_11 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_11 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L111] RET assume_abort_if_not(var_1_11 >= 64) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L112] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=256, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L113] var_1_13 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L114] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L115] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L115] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L116] var_1_14 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L117] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L118] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L119] var_1_16 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L120] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L121] var_1_17 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L122] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L123] var_1_18 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L124] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L125] var_1_20 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L126] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L127] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L127] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L140] RET updateVariables() [L141] CALL step() [L62] CALL functionized0(var_1_3) [L47] return (((- 64) + var_1_2) == functionized0_localFunctionVar0); [L62] RET functionized0(var_1_3) [L62] COND TRUE functionized0(var_1_3) [L63] var_1_1 = (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - var_1_5) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=126, var_1_20=0, var_1_21=-64, var_1_2=127, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L67] COND FALSE !(var_1_1 > var_1_4) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=126, var_1_20=0, var_1_21=-64, var_1_2=127, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=0] [L72] CALL functionized1(var_1_5, var_1_2) [L50] COND TRUE functionized1_localFunctionVar0 == (functionized1_localFunctionVar1 / var_1_4) [L51] var_1_9 = ((((functionized1_localFunctionVar0) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (functionized1_localFunctionVar0) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=25, var_1_13=-2147483648, var_1_14=32767, var_1_15=515/8, var_1_19=0, var_1_1=126, var_1_20=0, var_1_21=-64, var_1_2=127, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=1] [L72] RET functionized1(var_1_5, var_1_2) [L73] COND TRUE ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) <= ((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) [L74] CALL, EXPR functionized2(var_1_14) [L57] return ((functionized2_localFunctionVar0 - var_1_5) + ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))); [L74] RET, EXPR functionized2(var_1_14) [L74] var_1_12 = functionized2(var_1_14) [L78] COND TRUE (~ (var_1_5 * var_1_12)) <= var_1_9 [L79] var_1_15 = (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=32767, var_1_13=-2147483648, var_1_14=32767, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=126, var_1_20=0, var_1_21=-64, var_1_2=127, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=1] [L83] COND FALSE !(var_1_4 < var_1_3) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=32767, var_1_13=-2147483648, var_1_14=32767, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=126, var_1_20=0, var_1_21=-64, var_1_2=127, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=1] [L88] var_1_21 = var_1_10 [L141] RET step() [L142] CALL, EXPR property() [L132-L133] return (((((((((- 64) + var_1_2) == var_1_3) ? (var_1_1 == ((unsigned char) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - var_1_5))) : (var_1_1 == ((unsigned char) (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64)))) && ((var_1_1 > var_1_4) ? (((- var_1_7) < var_1_8) ? (var_1_6 == ((unsigned long int) 10u)) : 1) : 1)) && ((var_1_5 == (var_1_2 / var_1_4)) ? (var_1_9 == ((unsigned char) ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) : (var_1_9 == ((unsigned char) ((var_1_10 + var_1_11) - var_1_5))))) && ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) <= ((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4)))) ? (var_1_12 == ((unsigned short int) ((var_1_14 - var_1_5) + ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) : (var_1_12 == ((unsigned short int) var_1_9)))) && (((~ (var_1_5 * var_1_12)) <= var_1_9) ? (var_1_15 == ((double) (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))))) : (var_1_15 == ((double) ((((((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) < (var_1_18)) ? (((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) : (var_1_18))))))) && ((var_1_4 < var_1_3) ? ((var_1_9 > var_1_2) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_21 == ((signed short int) var_1_10)) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=32767, var_1_13=-2147483648, var_1_14=32767, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=126, var_1_20=0, var_1_21=63, var_1_2=127, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=63, var_1_11=64, var_1_12=32767, var_1_13=-2147483648, var_1_14=32767, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=126, var_1_20=0, var_1_21=63, var_1_2=127, var_1_3=63, var_1_4=-129, var_1_5=1, var_1_6=5, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 346 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 557 IncrementalHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 138 mSDtfsCounter, 557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=2, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 32 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 1508 SizeOfPredicates, 5 NumberOfNonLiveVariables, 323 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3886/4048 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-12 23:57:07,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_codestructure_functionizing_file-5.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 9856b6e1547c77dfc4f03d636d2ddc994fcf61a01f24b8f4037a8d4ac113cc74 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:57:09,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:57:09,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 23:57:09,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:57:09,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:57:09,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:57:09,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:57:09,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:57:09,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:57:09,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:57:09,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:57:09,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:57:09,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:57:09,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:57:09,643 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:57:09,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:57:09,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:57:09,644 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:57:09,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:57:09,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:57:09,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:57:09,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:57:09,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:57:09,645 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:57:09,646 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:57:09,646 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:57:09,646 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:57:09,646 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:57:09,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:57:09,647 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:57:09,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:57:09,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:57:09,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:57:09,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:57:09,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:57:09,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:57:09,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:57:09,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:57:09,649 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:57:09,649 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:57:09,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:57:09,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:57:09,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:57:09,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:57:09,653 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:57:09,653 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 -> 9856b6e1547c77dfc4f03d636d2ddc994fcf61a01f24b8f4037a8d4ac113cc74 [2024-10-12 23:57:09,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:57:09,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:57:09,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:57:09,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:57:09,924 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:57:09,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-5.i [2024-10-12 23:57:11,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:57:11,332 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:57:11,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-5.i [2024-10-12 23:57:11,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a94fc18/cb6c1d9bd50145e1bbdf84501f048377/FLAG6f79673bf [2024-10-12 23:57:11,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a94fc18/cb6c1d9bd50145e1bbdf84501f048377 [2024-10-12 23:57:11,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:57:11,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:57:11,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:57:11,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:57:11,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:57:11,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9b044a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11, skipping insertion in model container [2024-10-12 23:57:11,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:57:11,553 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_codestructure_functionizing_file-5.i[919,932] [2024-10-12 23:57:11,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:57:11,625 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:57:11,638 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_codestructure_functionizing_file-5.i[919,932] [2024-10-12 23:57:11,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:57:11,683 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:57:11,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11 WrapperNode [2024-10-12 23:57:11,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:57:11,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:57:11,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:57:11,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:57:11,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,730 INFO L138 Inliner]: procedures = 30, calls = 39, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 153 [2024-10-12 23:57:11,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:57:11,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:57:11,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:57:11,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:57:11,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,755 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:57:11,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:57:11,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:57:11,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:57:11,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:57:11,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (1/1) ... [2024-10-12 23:57:11,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:57:11,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:57:11,805 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-12 23:57:11,807 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-12 23:57:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:57:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:57:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:57:11,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:57:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:57:11,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:57:11,921 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:57:11,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:57:12,480 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-12 23:57:12,480 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:57:12,548 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:57:12,550 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:57:12,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:57:12 BoogieIcfgContainer [2024-10-12 23:57:12,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:57:12,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:57:12,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:57:12,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:57:12,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:57:11" (1/3) ... [2024-10-12 23:57:12,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed30a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:57:12, skipping insertion in model container [2024-10-12 23:57:12,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:57:11" (2/3) ... [2024-10-12 23:57:12,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed30a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:57:12, skipping insertion in model container [2024-10-12 23:57:12,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:57:12" (3/3) ... [2024-10-12 23:57:12,558 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-5.i [2024-10-12 23:57:12,570 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:57:12,570 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:57:12,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:57:12,623 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;@1acf8281, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:57:12,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:57:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 23:57:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 23:57:12,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:57:12,658 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:57:12,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:57:12,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:57:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1736344614, now seen corresponding path program 1 times [2024-10-12 23:57:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:57:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749329002] [2024-10-12 23:57:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:57:12,672 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-12 23:57:12,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:57:12,675 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-12 23:57:12,676 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-12 23:57:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:12,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 23:57:12,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:57:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-12 23:57:13,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:57:13,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:57:13,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749329002] [2024-10-12 23:57:13,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749329002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:57:13,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:57:13,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:57:13,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892027069] [2024-10-12 23:57:13,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:57:13,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:57:13,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:57:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:57:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:57:13,032 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-12 23:57:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:57:13,204 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2024-10-12 23:57:13,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:57:13,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 142 [2024-10-12 23:57:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:57:13,219 INFO L225 Difference]: With dead ends: 117 [2024-10-12 23:57:13,220 INFO L226 Difference]: Without dead ends: 58 [2024-10-12 23:57:13,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-12 23:57:13,224 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:57:13,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:57:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-12 23:57:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-12 23:57:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 23:57:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-10-12 23:57:13,275 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 142 [2024-10-12 23:57:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:57:13,275 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-10-12 23:57:13,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-12 23:57:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-10-12 23:57:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 23:57:13,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:57:13,282 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:57:13,291 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-12 23:57:13,485 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-12 23:57:13,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:57:13,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:57:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash 941625680, now seen corresponding path program 1 times [2024-10-12 23:57:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:57:13,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190984353] [2024-10-12 23:57:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:57:13,488 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-12 23:57:13,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:57:13,490 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-12 23:57:13,491 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-12 23:57:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:57:13,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 23:57:13,758 INFO L278 TraceCheckSpWp]: Computing forward predicates...