./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-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2179a43a83e486ac9d5e9c9fcb73d284bce02d99497a2b587e68e71bd6344001 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:16:00,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:16:00,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:16:00,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:16:00,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:16:00,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:16:00,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:16:00,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:16:00,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:16:00,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:16:00,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:16:00,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:16:00,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:16:00,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:16:00,563 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:16:00,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:16:00,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:16:00,565 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:16:00,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:16:00,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:16:00,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:16:00,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:16:00,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:16:00,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:16:00,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:16:00,571 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:16:00,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:16:00,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:16:00,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:16:00,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:16:00,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:16:00,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:16:00,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:16:00,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:16:00,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:16:00,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:16:00,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:16:00,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:16:00,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:16:00,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:16:00,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:16:00,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:16:00,576 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-clean/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-clean/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 -> 2179a43a83e486ac9d5e9c9fcb73d284bce02d99497a2b587e68e71bd6344001 [2024-10-11 07:16:00,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:16:00,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:16:00,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:16:00,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:16:00,906 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:16:00,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i [2024-10-11 07:16:02,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:16:02,600 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:16:02,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i [2024-10-11 07:16:02,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/183b926ad/acf2d14a5b3145e080528ee2b5089183/FLAG2f12cf1d4 [2024-10-11 07:16:02,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/183b926ad/acf2d14a5b3145e080528ee2b5089183 [2024-10-11 07:16:02,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:16:02,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:16:02,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:16:02,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:16:02,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:16:02,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:16:02" (1/1) ... [2024-10-11 07:16:02,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5febdd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:02, skipping insertion in model container [2024-10-11 07:16:02,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:16:02" (1/1) ... [2024-10-11 07:16:02,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:16:02,843 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-4.i[919,932] [2024-10-11 07:16:02,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:16:02,955 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:16:02,967 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-4.i[919,932] [2024-10-11 07:16:03,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:16:03,034 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:16:03,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03 WrapperNode [2024-10-11 07:16:03,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:16:03,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:16:03,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:16:03,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:16:03,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,116 INFO L138 Inliner]: procedures = 31, calls = 49, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 200 [2024-10-11 07:16:03,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:16:03,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:16:03,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:16:03,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:16:03,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,202 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-11 07:16:03,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,218 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:16:03,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:16:03,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:16:03,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:16:03,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (1/1) ... [2024-10-11 07:16:03,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:16:03,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:16:03,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:16:03,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:16:03,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:16:03,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:16:03,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:16:03,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:16:03,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:16:03,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:16:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure functionized4 [2024-10-11 07:16:03,356 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized4 [2024-10-11 07:16:03,461 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:16:03,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:16:03,836 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 07:16:03,836 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:16:03,896 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:16:03,896 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:16:03,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:16:03 BoogieIcfgContainer [2024-10-11 07:16:03,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:16:03,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:16:03,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:16:03,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:16:03,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:16:02" (1/3) ... [2024-10-11 07:16:03,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3460c5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:16:03, skipping insertion in model container [2024-10-11 07:16:03,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:03" (2/3) ... [2024-10-11 07:16:03,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3460c5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:16:03, skipping insertion in model container [2024-10-11 07:16:03,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:16:03" (3/3) ... [2024-10-11 07:16:03,906 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-4.i [2024-10-11 07:16:03,926 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:16:03,926 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:16:03,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:16:03,997 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;@46f2674a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:16:03,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:16:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:16:04,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 07:16:04,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:04,017 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:16:04,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:04,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:04,023 INFO L85 PathProgramCache]: Analyzing trace with hash 916486471, now seen corresponding path program 1 times [2024-10-11 07:16:04,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:16:04,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813111143] [2024-10-11 07:16:04,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:04,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:16:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:16:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:16:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:16:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:16:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:16:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:16:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:16:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:16:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:16:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:16:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:16:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:16:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:16:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:16:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:16:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:16:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:16:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:16:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:16:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:16:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:16:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:16:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:16:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:16:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:16:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:16:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:16:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 07:16:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 07:16:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 07:16:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 07:16:04,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:16:04,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813111143] [2024-10-11 07:16:04,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813111143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:16:04,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:16:04,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:16:04,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574636624] [2024-10-11 07:16:04,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:16:04,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:16:04,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:16:04,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:16:04,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:16:04,582 INFO L87 Difference]: Start difference. First operand has 81 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 07:16:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:16:04,663 INFO L93 Difference]: Finished difference Result 159 states and 282 transitions. [2024-10-11 07:16:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:16:04,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 179 [2024-10-11 07:16:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:16:04,674 INFO L225 Difference]: With dead ends: 159 [2024-10-11 07:16:04,674 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 07:16:04,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-11 07:16:04,682 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:16:04,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:16:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 07:16:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 07:16:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:16:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2024-10-11 07:16:04,735 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 179 [2024-10-11 07:16:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:16:04,736 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2024-10-11 07:16:04,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 07:16:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2024-10-11 07:16:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 07:16:04,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:04,744 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:16:04,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:16:04,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:04,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1896945731, now seen corresponding path program 1 times [2024-10-11 07:16:04,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:16:04,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397138856] [2024-10-11 07:16:04,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:16:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:16:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:16:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:16:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:16:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:16:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:16:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:16:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:16:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:16:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:16:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:16:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:16:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:16:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:16:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:16:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:16:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:16:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:16:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:16:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:16:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:16:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:16:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:16:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:16:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:16:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:16:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:16:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 07:16:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 07:16:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 07:16:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 07:16:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:16:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397138856] [2024-10-11 07:16:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397138856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:16:05,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:16:05,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:16:05,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951542570] [2024-10-11 07:16:05,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:16:05,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:16:05,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:16:05,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:16:05,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:16:05,936 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 07:16:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:16:06,261 INFO L93 Difference]: Finished difference Result 225 states and 338 transitions. [2024-10-11 07:16:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:16:06,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 179 [2024-10-11 07:16:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:16:06,267 INFO L225 Difference]: With dead ends: 225 [2024-10-11 07:16:06,268 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 07:16:06,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:16:06,272 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 104 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:16:06,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 273 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:16:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 07:16:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 120. [2024-10-11 07:16:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 78 states have internal predecessors, (106), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 07:16:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 182 transitions. [2024-10-11 07:16:06,304 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 182 transitions. Word has length 179 [2024-10-11 07:16:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:16:06,305 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 182 transitions. [2024-10-11 07:16:06,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 07:16:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 182 transitions. [2024-10-11 07:16:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 07:16:06,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:06,309 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:16:06,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:16:06,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:06,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2010538814, now seen corresponding path program 1 times [2024-10-11 07:16:06,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:16:06,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105621932] [2024-10-11 07:16:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:16:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:16:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:16:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:16:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:16:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:16:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:16:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:16:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:16:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:16:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:16:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:16:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:16:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:16:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:16:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:16:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:16:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:16:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:16:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:16:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:16:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:16:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:16:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:16:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:16:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:16:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:16:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:16:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 07:16:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 07:16:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 07:16:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 07:16:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:16:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105621932] [2024-10-11 07:16:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105621932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:16:07,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624038655] [2024-10-11 07:16:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:07,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:16:07,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:16:07,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:16:07,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:16:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:07,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 07:16:07,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:16:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2024-10-11 07:16:08,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:16:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 07:16:08,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624038655] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:16:08,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:16:08,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2024-10-11 07:16:08,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817743740] [2024-10-11 07:16:08,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:16:08,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 07:16:08,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:16:08,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 07:16:08,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-11 07:16:08,454 INFO L87 Difference]: Start difference. First operand 120 states and 182 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-11 07:16:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:16:09,944 INFO L93 Difference]: Finished difference Result 401 states and 580 transitions. [2024-10-11 07:16:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-11 07:16:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 179 [2024-10-11 07:16:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:16:09,949 INFO L225 Difference]: With dead ends: 401 [2024-10-11 07:16:09,950 INFO L226 Difference]: Without dead ends: 282 [2024-10-11 07:16:09,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 411 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=461, Invalid=1891, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 07:16:09,953 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 550 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:16:09,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 541 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 07:16:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-11 07:16:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 215. [2024-10-11 07:16:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 134 states have (on average 1.291044776119403) internal successors, (173), 136 states have internal predecessors, (173), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 07:16:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 317 transitions. [2024-10-11 07:16:10,012 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 317 transitions. Word has length 179 [2024-10-11 07:16:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:16:10,017 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 317 transitions. [2024-10-11 07:16:10,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-11 07:16:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 317 transitions. [2024-10-11 07:16:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 07:16:10,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:10,022 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:16:10,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:16:10,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:16:10,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:10,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2045551864, now seen corresponding path program 1 times [2024-10-11 07:16:10,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:16:10,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260526694] [2024-10-11 07:16:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:10,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:16:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:16:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:16:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:16:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:16:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:16:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:16:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:16:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:16:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:16:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:16:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:16:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:16:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:16:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:16:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:16:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:16:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:16:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:16:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:16:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:16:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:16:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:16:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:16:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:16:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:16:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:16:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:16:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 07:16:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 07:16:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 07:16:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 07:16:10,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:16:10,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260526694] [2024-10-11 07:16:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260526694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:16:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653532350] [2024-10-11 07:16:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:10,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:16:10,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:16:10,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:16:10,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 07:16:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:10,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 07:16:10,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:16:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 659 proven. 66 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-10-11 07:16:11,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:16:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 07:16:11,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653532350] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:16:11,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:16:11,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 07:16:11,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173457502] [2024-10-11 07:16:11,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:16:11,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:16:11,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:16:11,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:16:11,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:16:11,248 INFO L87 Difference]: Start difference. First operand 215 states and 317 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-10-11 07:16:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:16:11,453 INFO L93 Difference]: Finished difference Result 320 states and 463 transitions. [2024-10-11 07:16:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:16:11,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 180 [2024-10-11 07:16:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:16:11,458 INFO L225 Difference]: With dead ends: 320 [2024-10-11 07:16:11,458 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 07:16:11,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:16:11,462 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 32 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:16:11,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 136 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:16:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 07:16:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2024-10-11 07:16:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 states have internal predecessors, (71), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:16:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-11 07:16:11,493 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 180 [2024-10-11 07:16:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:16:11,495 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-11 07:16:11,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-10-11 07:16:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-11 07:16:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 07:16:11,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:11,498 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:16:11,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 07:16:11,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:16:11,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:11,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1392034441, now seen corresponding path program 1 times [2024-10-11 07:16:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:16:11,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986768287] [2024-10-11 07:16:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:11,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:16:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:16:11,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148277384] [2024-10-11 07:16:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:11,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:16:11,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:16:11,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:16:11,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 07:16:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:16:12,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:16:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:16:12,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:16:12,186 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:16:12,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:16:12,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 07:16:12,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:16:12,393 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 07:16:12,529 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:16:12,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:16:12 BoogieIcfgContainer [2024-10-11 07:16:12,532 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:16:12,533 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:16:12,533 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:16:12,533 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:16:12,534 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:16:03" (3/4) ... [2024-10-11 07:16:12,536 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:16:12,537 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:16:12,537 INFO L158 Benchmark]: Toolchain (without parser) took 9897.79ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 109.4MB in the beginning and 158.9MB in the end (delta: -49.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-10-11 07:16:12,538 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 100.7MB. Free memory was 63.5MB in the beginning and 63.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:16:12,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.68ms. Allocated memory is still 163.6MB. Free memory was 109.4MB in the beginning and 93.3MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:16:12,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.91ms. Allocated memory is still 163.6MB. Free memory was 93.3MB in the beginning and 90.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:16:12,538 INFO L158 Benchmark]: Boogie Preprocessor took 126.84ms. Allocated memory is still 163.6MB. Free memory was 90.1MB in the beginning and 130.3MB in the end (delta: -40.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-10-11 07:16:12,539 INFO L158 Benchmark]: RCFGBuilder took 652.18ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 106.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 07:16:12,539 INFO L158 Benchmark]: TraceAbstraction took 8633.09ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 105.4MB in the beginning and 158.9MB in the end (delta: -53.4MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-10-11 07:16:12,539 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 243.3MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:16:12,541 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 100.7MB. Free memory was 63.5MB in the beginning and 63.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.68ms. Allocated memory is still 163.6MB. Free memory was 109.4MB in the beginning and 93.3MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.91ms. Allocated memory is still 163.6MB. Free memory was 93.3MB in the beginning and 90.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.84ms. Allocated memory is still 163.6MB. Free memory was 90.1MB in the beginning and 130.3MB in the end (delta: -40.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * RCFGBuilder took 652.18ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 106.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8633.09ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 105.4MB in the beginning and 158.9MB in the end (delta: -53.4MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 243.3MB. Free memory is still 158.9MB. 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 someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L26] unsigned char isInitial = 0; [L27] unsigned char var_1_1 = 0; [L28] unsigned short int var_1_2 = 256; [L29] unsigned short int var_1_3 = 128; [L30] unsigned char var_1_4 = 0; [L31] unsigned char var_1_5 = 0; [L32] unsigned short int var_1_6 = 4; [L33] signed short int var_1_7 = 32; [L34] signed long int var_1_8 = 100000000; [L35] unsigned short int var_1_9 = 4; [L36] unsigned short int var_1_10 = 10; [L37] double var_1_11 = 15.6; [L38] double var_1_12 = 256.4; [L39] double var_1_13 = 49.15; [L40] unsigned long int var_1_14 = 500; [L41] unsigned long int var_1_15 = 2173307753; [L42] unsigned long int var_1_16 = 3362224480; [L43] signed short int var_1_17 = 16; [L44] unsigned short int var_1_18 = 16; [L45] signed short int var_1_19 = 16; [L46] signed short int var_1_20 = 4; [L47] signed short int var_1_21 = 0; [L48] signed short int var_1_22 = -25; [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] FCALL updateLastVariables() [L165] CALL updateVariables() [L107] var_1_2 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L108] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L109] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L109] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L110] var_1_3 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L111] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L112] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L112] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L113] var_1_4 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L114] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L115] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L116] var_1_5 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L117] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L118] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L119] var_1_7 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L120] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L121] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L122] var_1_8 = __VERIFIER_nondet_long() [L123] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L123] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L124] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L124] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L125] var_1_10 = __VERIFIER_nondet_ushort() [L126] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L126] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L127] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L127] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L128] var_1_12 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L129] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L130] var_1_13 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L131] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L132] var_1_15 = __VERIFIER_nondet_ulong() [L133] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L133] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L134] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L135] var_1_16 = __VERIFIER_nondet_ulong() [L136] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L136] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L137] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L138] var_1_18 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L139] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_18 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L140] RET assume_abort_if_not(var_1_18 <= 65535) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L141] var_1_19 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L142] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L143] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L144] var_1_20 = __VERIFIER_nondet_short() [L145] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L145] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L146] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L147] var_1_21 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L148] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L149] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L150] var_1_22 = __VERIFIER_nondet_short() [L151] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L151] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L152] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L165] RET updateVariables() [L166] CALL step() [L71] COND FALSE !(var_1_2 <= var_1_3) [L76] var_1_1 = (var_1_4 || var_1_5) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=3, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L78] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=3, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L83] COND FALSE !(var_1_4 || var_1_1) [L86] CALL functionized2(var_1_10, var_1_3) [L56] COND TRUE var_1_7 >= functionized2_localFunctionVar1 [L57] var_1_9 = functionized2_localFunctionVar0 VAL [isInitial=1, var_1_10=65534, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=3, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=65534] [L86] RET functionized2(var_1_10, var_1_3) [L88] COND FALSE !(var_1_6 <= var_1_2) [L93] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=65534, var_1_11=2, var_1_12=2, var_1_14=500, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=3, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=65534] [L95] COND TRUE var_1_6 >= var_1_3 [L96] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - var_1_2) VAL [isInitial=1, var_1_10=65534, var_1_11=2, var_1_12=2, var_1_14=16106061821, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=3, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=65534] [L98] var_1_1 && (functionized3(var_1_5, var_1_13)) VAL [isInitial=1, var_1_10=65534, var_1_11=2, var_1_12=2, var_1_14=16106061821, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=3, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=65534] [L98] COND FALSE !(var_1_1 && (functionized3(var_1_5, var_1_13))) [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return ((((((var_1_2 <= var_1_3) ? (((- var_1_3) > var_1_2) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((var_1_2 * (var_1_3 + var_1_7)) > var_1_8) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_7 >= var_1_3) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_6 <= var_1_2) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((var_1_6 >= var_1_3) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - var_1_2))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (var_1_9 >= ((((var_1_18) > (var_1_7)) ? (var_1_18) : (var_1_7))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=65534, var_1_11=2, var_1_12=2, var_1_14=16106061821, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_18=0, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=3, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=65534] [L19] reach_error() VAL [isInitial=1, var_1_10=65534, var_1_11=2, var_1_12=2, var_1_14=16106061821, var_1_15=2147483647, var_1_16=16106127358, var_1_17=16, var_1_18=0, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=3, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 5, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 707 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 686 mSDsluCounter, 1065 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 677 mSDsCounter, 349 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 880 IncrementalHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 349 mSolverCounterUnsat, 388 mSDtfsCounter, 880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1045 GetRequests, 981 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=3, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 100 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1438 NumberOfCodeBlocks, 1438 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1427 ConstructedInterpolants, 0 QuantifiedInterpolants, 4407 SizeOfPredicates, 6 NumberOfNonLiveVariables, 774 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 13506/13920 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-11 07:16:12,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2179a43a83e486ac9d5e9c9fcb73d284bce02d99497a2b587e68e71bd6344001 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:16:14,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:16:14,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:16:14,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:16:14,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:16:14,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:16:14,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:16:14,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:16:14,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:16:14,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:16:14,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:16:14,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:16:14,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:16:14,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:16:14,869 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:16:14,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:16:14,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:16:14,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:16:14,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:16:14,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:16:14,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:16:14,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:16:14,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:16:14,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:16:14,876 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:16:14,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:16:14,877 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:16:14,877 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:16:14,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:16:14,877 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:16:14,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:16:14,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:16:14,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:16:14,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:16:14,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:16:14,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:16:14,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:16:14,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:16:14,882 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:16:14,882 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:16:14,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:16:14,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:16:14,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:16:14,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:16:14,884 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:16:14,885 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-clean/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-clean/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 -> 2179a43a83e486ac9d5e9c9fcb73d284bce02d99497a2b587e68e71bd6344001 [2024-10-11 07:16:15,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:16:15,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:16:15,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:16:15,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:16:15,234 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:16:15,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i [2024-10-11 07:16:16,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:16:16,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:16:16,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-4.i [2024-10-11 07:16:16,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/12e34561e/d2408f3156ec43fbb0d33a724751a4ff/FLAG45eb7cda4 [2024-10-11 07:16:16,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/12e34561e/d2408f3156ec43fbb0d33a724751a4ff [2024-10-11 07:16:16,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:16:16,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:16:16,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:16:16,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:16:16,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:16:16,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:16:16" (1/1) ... [2024-10-11 07:16:17,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc3cccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:16, skipping insertion in model container [2024-10-11 07:16:17,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:16:16" (1/1) ... [2024-10-11 07:16:17,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:16:17,241 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-4.i[919,932] [2024-10-11 07:16:17,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:16:17,353 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:16:17,364 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-4.i[919,932] [2024-10-11 07:16:17,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:16:17,421 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:16:17,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17 WrapperNode [2024-10-11 07:16:17,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:16:17,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:16:17,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:16:17,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:16:17,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,475 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 191 [2024-10-11 07:16:17,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:16:17,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:16:17,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:16:17,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:16:17,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,514 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-11 07:16:17,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:16:17,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:16:17,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:16:17,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:16:17,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (1/1) ... [2024-10-11 07:16:17,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:16:17,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:16:17,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:16:17,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:16:17,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:16:17,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:16:17,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:16:17,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:16:17,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:16:17,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:16:17,652 INFO L130 BoogieDeclarations]: Found specification of procedure functionized4 [2024-10-11 07:16:17,652 INFO L138 BoogieDeclarations]: Found implementation of procedure functionized4 [2024-10-11 07:16:17,759 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:16:17,761 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:16:18,581 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 07:16:18,582 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:16:18,672 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:16:18,673 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:16:18,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:16:18 BoogieIcfgContainer [2024-10-11 07:16:18,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:16:18,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:16:18,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:16:18,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:16:18,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:16:16" (1/3) ... [2024-10-11 07:16:18,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654a95e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:16:18, skipping insertion in model container [2024-10-11 07:16:18,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:17" (2/3) ... [2024-10-11 07:16:18,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654a95e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:16:18, skipping insertion in model container [2024-10-11 07:16:18,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:16:18" (3/3) ... [2024-10-11 07:16:18,685 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-4.i [2024-10-11 07:16:18,701 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:16:18,703 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:16:18,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:16:18,809 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;@85edbaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:16:18,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:16:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 45 states have internal predecessors, (62), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:16:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 07:16:18,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:18,831 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:16:18,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:18,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash 98174377, now seen corresponding path program 1 times [2024-10-11 07:16:18,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:16:18,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437277669] [2024-10-11 07:16:18,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:18,853 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-11 07:16:18,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:16:18,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 07:16:18,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:16:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:19,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:16:19,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:16:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 874 proven. 0 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2024-10-11 07:16:19,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:16:19,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:16:19,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437277669] [2024-10-11 07:16:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437277669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:16:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:16:19,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:16:19,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822284864] [2024-10-11 07:16:19,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:16:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:16:19,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:16:19,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:16:19,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:16:19,257 INFO L87 Difference]: Start difference. First operand has 80 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 45 states have internal predecessors, (62), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 07:16:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:16:19,535 INFO L93 Difference]: Finished difference Result 157 states and 280 transitions. [2024-10-11 07:16:19,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:16:19,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 179 [2024-10-11 07:16:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:16:19,548 INFO L225 Difference]: With dead ends: 157 [2024-10-11 07:16:19,548 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 07:16:19,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 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-11 07:16:19,556 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:16:19,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:16:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 07:16:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 07:16:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:16:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-10-11 07:16:19,601 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 179 [2024-10-11 07:16:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:16:19,601 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-10-11 07:16:19,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 07:16:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-10-11 07:16:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 07:16:19,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:19,606 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:16:19,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:16:19,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 07:16:19,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:19,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1078633637, now seen corresponding path program 1 times [2024-10-11 07:16:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:16:19,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542507102] [2024-10-11 07:16:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:19,811 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-11 07:16:19,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:16:19,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 07:16:19,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:16:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:20,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 07:16:20,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:16:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 635 proven. 135 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-10-11 07:16:21,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:16:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 138 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-10-11 07:16:21,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:16:21,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542507102] [2024-10-11 07:16:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542507102] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:16:21,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:16:21,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-11 07:16:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547892045] [2024-10-11 07:16:21,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:16:21,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 07:16:21,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:16:21,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 07:16:21,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-11 07:16:21,583 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-11 07:16:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:16:22,995 INFO L93 Difference]: Finished difference Result 200 states and 296 transitions. [2024-10-11 07:16:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 07:16:22,996 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 179 [2024-10-11 07:16:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:16:22,999 INFO L225 Difference]: With dead ends: 200 [2024-10-11 07:16:22,999 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 07:16:23,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 344 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2024-10-11 07:16:23,005 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 157 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:16:23,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 313 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 07:16:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 07:16:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2024-10-11 07:16:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 07:16:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-10-11 07:16:23,033 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 179 [2024-10-11 07:16:23,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:16:23,033 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-10-11 07:16:23,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-11 07:16:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-10-11 07:16:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 07:16:23,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:23,036 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:16:23,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 07:16:23,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 07:16:23,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:23,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:23,238 INFO L85 PathProgramCache]: Analyzing trace with hash -874879230, now seen corresponding path program 1 times [2024-10-11 07:16:23,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:16:23,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275944572] [2024-10-11 07:16:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:23,239 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-11 07:16:23,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:16:23,246 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 07:16:23,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:16:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:23,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 07:16:23,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:16:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2024-10-11 07:16:24,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:16:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 07:16:24,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:16:24,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275944572] [2024-10-11 07:16:24,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275944572] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:16:24,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:16:24,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2024-10-11 07:16:24,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467989496] [2024-10-11 07:16:24,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:16:24,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:16:24,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:16:24,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:16:24,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:16:24,704 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2024-10-11 07:16:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:16:25,458 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2024-10-11 07:16:25,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:16:25,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 180 [2024-10-11 07:16:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:16:25,461 INFO L225 Difference]: With dead ends: 212 [2024-10-11 07:16:25,461 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 07:16:25,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:16:25,463 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 93 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 07:16:25,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 146 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 07:16:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 07:16:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2024-10-11 07:16:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:16:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-10-11 07:16:25,477 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 180 [2024-10-11 07:16:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:16:25,478 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-10-11 07:16:25,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2024-10-11 07:16:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-10-11 07:16:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 07:16:25,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:25,480 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:16:25,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 07:16:25,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 07:16:25,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:25,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:25,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1002679915, now seen corresponding path program 1 times [2024-10-11 07:16:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:16:25,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88309331] [2024-10-11 07:16:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:25,683 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-11 07:16:25,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:16:25,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 07:16:25,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 07:16:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:25,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 07:16:25,876 INFO L278 TraceCheckSpWp]: Computing forward predicates...